منابع مشابه
Counting connected graphs inside-out
The theme of this work is an “inside-out” approach to the enumeration of graphs. It is based on a well-known decomposition of a graph into its 2-core, i.e. the largest subgraph of minimum degree 2 or more, and a forest of trees attached. Using our earlier (asymptotic) formulae for the total number of 2-cores with a given number of vertices and edges, we solve the corresponding enumeration probl...
متن کاملCounting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k − 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the probabilistic method, analyzing breadth-first search on the random graph G(k, p) for an appropriate edge probability p. Central is analysis of a random walk with fixed beginning and end which is tilted to the left.
متن کاملCounting Connected Set Partitions of Graphs
Let G = (V,E) be a simple undirected graph with n vertices then a set partition π = {V1, . . . , Vk} of the vertex set of G is a connected set partition if each subgraph G[Vj ] induced by the blocks Vj of π is connected for 1 ≤ j ≤ k. Define qi(G) as the number of connected set partitions in G with i blocks. The partition polynomial is Q(G,x) = ∑n i=0 qi(G)x . This paper presents a splitting ap...
متن کاملCounting unlabelled three-connected and homeomorphically irreducible two-connected graphs
A graph will be assumed to be finite and unoriented, with no loops or multiple edges; if multiple edges are to be allowed, the term multigraph will be used. A graph or multigraph. will be called k-connected if at least k vertices and their incident edges must be removed to disconnect it (a complete graph is considered to be k-connected for any k). A block (respectively, multiblock) is a 2-conne...
متن کاملCounting Connected Graphs and Hypergraphs via the Probabilistic Method
It is exponentially unlikely that a sparse random graph or hypergraph is connected, but such graphs occur commonly as the giant components of larger random graphs. This simple observation allows us to estimate the number of connected graphs, and more generally the number of connected d-uniform hypergraphs, on n vertices with m = O(n) edges. We also estimate the probability that a binomial rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2005
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2004.09.005